Substitution Principle and semidirect products
نویسندگان
چکیده
Abstract In the classical theory of regular languages, concept recognition by profinite monoids is an important tool. Beyond regularity, Boolean spaces with internal (BiMs) were recently proposed as a generalization. On other hand, fragments logic defining languages can be studied inductively via so-called “Substitution Principle.” this paper, we make logical underpinnings principle explicit and extend it to arbitrary using Stone duality. Subsequently, show how used obtain topo-algebraic recognizers for classes defined wide class first-order fragments. This naturally leads notion semidirect product BiMs extending such construction monoids. Our main result generalization Almeida Weil’s Decomposition Theorem products from setting that BiMs. crucial step in program methods language complexity theory.
منابع مشابه
Proonite Categories and Semidirect Products
After developing a theory of implicit operations and proving an analogue of Reiterman's theorem for categories, this paper addresses two complementary questions for semidirect products and two-sided semidirect products of pseudovarieties of semigroups: to determine when a pseudoidentity is valid in it, and to nd a basis of pseudoidentities. The rst question involves looking into the structure o...
متن کاملSemidirect products of ordered semigroups
We introduce semidirect and wreath products of finite ordered semigroups and extend some standard decomposition results to this case.
متن کاملSemidirect Products of Association Schemes
In his 1996 work developing the theory of association schemes as a ‘generalized’ group theory, Zieschang introduced the concept of the semidirect product as a possible product operation of certain association schemes. In this paper we extend the semidirect product operation into the entire set of association schemes. We then derive a way to decompose certain association schemes into smaller ass...
متن کاملSemidirect Products of Regular Semigroups
Within the usual semidirect product S ∗ T of regular semigroups S and T lies the set Reg (S ∗ T ) of its regular elements. Whenever S or T is completely simple, Reg (S ∗T ) is a (regular) subsemigroup. It is this ‘product’ that is the theme of the paper. It is best studied within the framework of existence (or e-) varieties of regular semigroups. Given two such classes, U and V, the e-variety U...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2023
ISSN: ['1469-8072', '0960-1295']
DOI: https://doi.org/10.1017/s0960129523000294